Analyzing Contention and Backo in Asynchronous Shared Memory
نویسندگان
چکیده
Randomized backo protocols have long been used to reduce contention on shared resources. ey are heavily used in communication channels and radio networks, and have also been shown to greatly improve the performance of shared memory algorithms in real systems. However, while backo protocols are well understood in many seings, their eect in shared memory has never been theoretically analyzed. is discrepency may be due to the diculty of modeling asynchrony without eliminating the advantage gained by local delays. In this paper, we introduce a new cost model for contention in shared memory. Our model allows for adversarial asynchrony, but also provides a clear notion of time, thus enabling easy calculation of contention costs and delays. We then consider a simple use case in which n processes try to update a single memory location. Using our model, we rst show that a naı̈ve protocol, without any backo, requires Ω(n3) work until all processes successfully update that location. We then analyze the commonly used exponential delay protocol, and show that it requires Θ(n2 logn) work with high probability. Finally, we show that the exponential delay protocol is suboptimal, by introducing a new backo protocol based on adaptive probabilities and showing that, for the same use case, it requires only O (n2) work with high probability. ACM Reference format: Naama Ben-David and Guy E. Blelloch. 2017. Analyzing Contention and Backo in Asynchronous Shared Memory. In Proceedings of PODC’17, July 25-27, 2017, Washington, DC, USA, , 10 pages. DOI: 10.1145/3087801.3087828
منابع مشابه
Analyzing Contention and Backoff in Asynchronous Shared Memory
Randomized backo protocols have long been used to reduce contention on shared resources. ey are heavily used in communication channels and radio networks, and have also been shown to greatly improve the performance of shared memory algorithms in real systems. However, while backo protocols are well understood in many seings, their eect in shared memory has never been theoretically analyzed...
متن کاملFast Mutual Exclusion, Even With Contention
We present a mutual exclusion algorithm that performs well both with and without contention, on machines with no atomic instructions other than read and write. The algorithm capitalizes on the ability of memory systems to read and write at both fulland half-word granularities. It depends on predictable processor execution rates, but requires no bound on the length of critical sections, performs...
متن کاملContention in Shared
Most complexitymeasures for concurrent algorithms for asynchronous sharedmemory architectures focus on process steps and memory consumption. In practice, however, performance of multiprocessor algorithms is heavily inuenced by contention, the extent to which processes access the same location at the same time. Nevertheless, even though contention is one of the principal considerations a ecting ...
متن کاملThe Queue-Read Queue-Write Asynchronous PRAM Model
This paper presents results for the queue-read, queue-write asynchronous parallel random access machine (qrqw asynchronous pram) model, which is the asynchronous variant of the qrqw pram model. The qrqw pram family of models, which was introduced earlier by the authors, permit concurrent reading and writing to shared memory locations, but each memory location is viewed as having a queue which c...
متن کاملThe Queue - Read Queue - WriteAsynchronous PRAM
This paper presents results for the queue-read, queue-write asynchronous parallel random access machine (qrqw asynchronous pram) model, which is the asynchronous variant of the qrqw pram model. The qrqw pram family of models, which was introduced earlier by the authors, permit concurrent reading and writing to shared memory locations, but each memory location is viewed as having a queue which c...
متن کامل